Design of new $$4\times 4$$ 4 × 4 S-box from finite commutative chain rings
نویسندگان
چکیده
منابع مشابه
Non - commutative finite monoids of a given order n ≥ 4
For a given integer n = p1 1 p α2 2 . . . p αk k , (k ≥ 2), we give here a class of finitely presented finite monoids of order n. Indeed the monoids Mon(π), where π = 〈a1, a2, . . . , ak|a p αi i i = ai, (i = 1, 2, . . . , k), aiai+1 = ai, (i = 1, 2, . . . , k − 1)〉. As a result of this study we are able to classify a wide family of the kgenerated p-monoids (finite monoids of order a power of a...
متن کاملA Review of Existing 4-bit Crypto S-box cryptanalysis Techniques and Two New Techniques with 4-bit Boolean Functions for Cryptanalysis of 4-bit Crypto S-boxes
4-bit Linear Relations play an important role in Cryptanalysis of 4-bit Bijective Crypto S-boxes. 4-bit finite differences also a major part of cryptanalysis of 4-bit substitution boxes. Count of existence of all 4-bit linear relations, for all of 16 input and 16 output 4-bit bit patterns of 4-bit bijective crypto S-boxes said as S-boxes has been reported in Linear Cryptanalysis of 4-bit S-boxe...
متن کاملS 4 : An Adduct from HgI 2 Molecules and Undistorted As 4 S 4 Cages
Copper(I) halides have been successfully established as a preparative tool for the synthesis of neutral and low-charge molecules of the fifth and sixth main-group elements. Inspired by publications of Rabenau et al. as well as M$ller and Jeitschko, a whole series of phosphorus, phosphorus chalcogenide, and heteroatomic chalcogen molecules were obtained in a copper halide matrix. Mixed phosphoru...
متن کامل4 Generalized E - Rings
A ring R is called an E-ring if the canonical homomorphism from R to the endomorphism ring End (RZ) of the additive group RZ, taking any r ∈ R to the endomorphism left multiplication by r turns out to be an isomorphism of rings. In this case RZ is called an E-group. Obvious examples of E-rings are subrings of Q. However there is a proper class of examples constructed recently, see [8]. E-rings ...
متن کاملConstructions of self-dual codes over finite commutative chain rings
We study self-dual codes over chain rings. We describe a technique for constructing new self-dual codes from existing codes and we prove that for chain rings containing an element c with c = −1 all self-dual codes can be constructed by this technique. We extend this construction to self-dual codes over principal ideal rings via the Chinese Remainder Theorem. We use torsion codes to describe the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational and Applied Mathematics
سال: 2015
ISSN: 0101-8205,1807-0302
DOI: 10.1007/s40314-015-0265-9